package com.fengye.algorithms.leecode.dp;

/**
 * @Author fengye
 * @Date 2023/5/13 19:22
 **/
public class FibonacciNumber509 {
   public static void main(String[] args) {
        System.out.println(new FibonacciNumber509().fib(3));
    }
    public int fib(int n) {
        if(n<=1){
            return n;
        }

        int[] dp = new int[n+1];
        dp[1] = 1;
        for(int i=2;i<=n;i++) {
            dp[i] = dp[i-1] + dp[i-2];
        }
        return dp[n];
    }
}
